Blind Deblurring Using Internal Patch Recurrence: Supplamentary Material

نویسندگان

  • Tomer Michaeli
  • Michal Irani
چکیده

1. We discuss the mapping between the error-ratio measure computed with the nonblind deblurring algorithm of Levin et al. [11] and the error-ratio measure computed with the nonblind-deblurring method of Zoran and Weiss [22]. 2. We explain why down-sampling an image using a sinc kernel has an effect of aliasing-aware sharpening. The error-ratio measure r (Eq. (15) in the paper), which is standardly used to quantify the performance of blind-deblurring methods, depends on the type of non-blind deblurring algorithm used for the final deblurring stage. The error-ratios reported in our paper (and also used in [18]) were computed with the current state-of-the-art non-blind deblurring method of Zoran and Weiss [22]. Previous studies (e.g., [12,13]) reported error-ratios computed with the non-blind deblurring method of Levin et al. [11] (the state-of-the-art at that time). In the figure below we re-plot the cumulative distribution of error-ratios, but this time computed with [11]. As can be seen, the absolute error-ratio values are different than those in the corresponding graph (Fig. 5 in the paper) of error-ratios computed with [22]. Nonetheless, the two graphs reflect the same relative behavior of all the methods. In the table below we report the average performance, worst-case performance and success rate of all algorithms, this time using error-ratios computed with the non-blind deblurring of [11]. We note that for this setting, the blind deblurring paper of Levin et al. [13] reported a threshold of 3 between good and bad visual results. Consequently, we regard success rate in this context as the percent of images with error-ratio smaller than 3. As in the corresponding table (Table 1 in the paper) of error-ratios computed with the non-blind deblurring of [22], this table shows that our method and the method of Sun et al. [18] outperform all other methods in all three categories. The average performance of our method is close to that of Sun et al. [18], while our worst-case performance is significantly better. Note that also when using this measure, only three methods (the same three) attain an average error ratio smaller than 3: Our method, Sun et al. [18], Xu and Jia [19]. The figure below further shows a scatter-plot of both types of error-ratios. Each point in this plot corresponds to a kernel produced by one of the 7 tested blind-deblurring methods on one of the 640 blurry images in the database (once used with the non-blind deblurring …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Blind Deblurring Using Internal Patch Recurrence

Recurrence of small image patches across different scales of a natural image has been previously used for solving ill-posed problems (e.g., superresolution from a single image). In this paper we show how this multi-scale property can also be used for “blind-deblurring”, namely, removal of an unknown blur from a blurry image. While patches repeat ‘as is’ across scales in a sharp natural image, t...

متن کامل

Blind Image Deblurring via Reweighted Graph Total Variation

Blind image deblurring, i.e., deblurring without knowledge of the blur kernel, is a highly ill-posed problem. The problem can be solved in two parts: i) estimate a blur kernel from the blurry image, and ii) given estimated blur kernel, de-convolve blurry input to restore the target image. In this paper, by interpreting an image patch as a signal on a weighted graph, we first argue that a skelet...

متن کامل

Graph-Based Blind Image Deblurring From a Single Photograph

Blind image deblurring, i.e., deblurring without knowledge of the blur kernel, is a highly ill-posed problem. The problem can be solved in two parts: i) estimate a blur kernel from the blurry image, and ii) given estimated blur kernel, deconvolve blurry input to restore the target image. In this paper, we propose a graph-based blind image deblurring algorithm by interpreting an image patch as a...

متن کامل

Blind Image Deblurring with Outlier Handling Supplemental Material

In this supplemental material, we analyze how the proposed blind image deblurring method performs on images with outliers and demonstrate the effectiveness of the proposed data fidelity term in Section 1. Section 2 provides more analysis of the proposed algorithm. We quantitatively evaluate the proposed algorithm and compare it against existing blind deblurring methods on the datasets with outl...

متن کامل

Patch Mosaic for Fast Motion Deblurring

This paper proposes using a mosaic image patches composed of the most informative edges found in the original blurry image for the purpose of estimating a motion blur kernel with minimum computational cost. To select these patches we develop a new image analysis tool to efficiently locate informative patches we call the informative-edge map. The combination of patch mosaic and informative patch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014